Rapid calculation of RMSDs using a quaternion-based characteristic polynomial.

نویسنده

  • Douglas L Theobald
چکیده

A common measure of conformational similarity in structural bioinformatics is the minimum root mean square deviation (RMSD) between the coordinates of two macromolecules. In many applications, the rotations relating the structures are not needed. Several common algorithms for calculating RMSDs require the computationally costly procedures of determining either the eigen decomposition or matrix inversion of a 3x3 or 4x4 matrix. Using a quaternion-based method, here a simple algorithm is developed that rapidly and stably determines RMSDs by circumventing the decomposition and inversion problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the Zeros of Quaternion Polynomials

A method is developed to compute the zeros of a quaternion polynomial with all terms of the form ok Xk. This method is based essentially in Niven’s algorithm (11, which consists of dividing the polynomial by a characteristic polynomial associated to a zero. The information about the trace and the norm of the zero is obtained by an original idea which requires the companion matrix associated to ...

متن کامل

Determination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial

Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...

متن کامل

Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications

ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...

متن کامل

Ela General Polynomials over Division Algebras and Left Eigenvalues

In this paper, we present an isomorphism between the ring of general polynomials over a division algebra D with center F and the group ring of the free monoid with [D : F ] variables over D. Using this isomorphism, we define the characteristic polynomial of any matrix over any division algebra, i.e., a general polynomial with one variable over the algebra whose roots are precisely the left eige...

متن کامل

General polynomials over division algebras and left eigenvalues

In this paper, we present an isomorphism between the ring of general polynomials over a division algebra D with center F and the group ring of the free monoid with [D : F ] variables over D. Using this isomorphism, we define the characteristic polynomial of any matrix over any division algebra, i.e., a general polynomial with one variable over the algebra whose roots are precisely the left eige...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Acta crystallographica. Section A, Foundations of crystallography

دوره 61 Pt 4  شماره 

صفحات  -

تاریخ انتشار 2005